Exclusion regions for optimization problems
نویسندگان
چکیده
منابع مشابه
Exclusion regions for optimization problems
Branch and bound methods for finding all solutions of a global optimization problem in a box frequently have the difficulty that subboxes containing no solution cannot be easily eliminated if they are close to the global minimum. This has the effect that near each global minimum, and in the process of solving the problem also near the currently best found local minimum, many small boxes are cre...
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملOn exclusion regions for optimal triangulations
An exclusion region for a triangulation is a region that can be placed around each edge of the triangulation such that the region can not contain points from the set on both sides of the edge. We survey known exclusion regions for several classes of triangulations, including Delaunay, Greedy, and Minimum Weight triangulations. We then show an exclusion region of larger area than was previously ...
متن کاملExclusion Regions for Systems of Equations
Branch and bound methods for finding all zeros of a nonlinear system of equations in a box frequently have the difficulty that subboxes containing no solution cannot be easily eliminated if there is a nearby zero outside the box. This has the effect that near each zero many small boxes are created by repeated splitting, whose processing may dominate the total work spent on the global search. Th...
متن کاملShortest Paths Help Solve Geometric Optimization Problems in Planar Regions
The goal of this paper is to show that the concept of the shortest path inside a polygonal region contributes to the design of eecient algorithms for certain geometric optimization problems involving simple polygons: computing optimum separators, maximum area or perimeter inscribed triangles, a minimum area circumscribed concave quadrilateral, or a maximum area contained triangle. The structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2014
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-013-0137-z